Simplified Semantics and Debugging of Concurrent Programs via Targeted Race Detection
نویسندگان
چکیده
of the Dissertation Simplified Semantics and Debugging of Concurrent Programs via Targeted Race Detection
منابع مشابه
Simple thread semantics require race detection
Data race detectors are commonly viewed as debugging tools. We argue that if we knew how to make them both fully accurate and sufficiently fast for “always on” use, they could address an additional and much more foundational role: They would allow us to give precise, simple, and safe semantics to shared variables in multithreaded programs, a problem that has so far defied a complete solution.
متن کاملDebugging Concurrent Programs with Sequential Analysis
The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent programs, such as model checking, explore all possible thread interleavings. Since the number of thread interleavings increases exponentially with the number of threads, such analyses have high computational complexity....
متن کاملRestructuring Parallel Programs for On-the-Fly Race Detection
Detecting races is important for debugging explicit shared-memory parallel programs, because the races result in unintended non-deterministic executions of the programs. Previous on-they techniques to detect races in parallel programs with inter-thread coordination show serious space overhead in two components of complexity, and can not guarantee that, in an execution instance, the race detecte...
متن کاملEfficient Race Condition Detection for Shared-Memory Programs with Post/Wait Synchronization
Shared-memory parallel programs are often designed to be deterministic, both in their final results and intermediate states. However, debugging such programs requires a mechanism for locating race conditions or violations of the intended determinacy when they occur. This paper answers a previously open question by presenting the first precise, efficient algorithm for dynamically detecting race ...
متن کاملStatic Analysis of Concurrency Constructs in Higher-Order Programs
Detecting and debugging concurrency bugs is particularly hard. The complexity of concurrent programs is huge due to the exponential number of possible interleavings between the multiple units of execution of those programs. Having help from the computer to detect concurrency bugs — or prove their absence — can substantially reduce debugging time. In this dissertation, we investigate the use of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011